Benchmark experiment of large-angle scattering reaction cross section of iron at 14 MeV using two shadow bars – Comparison of experimental results with ENDF/B-VIII –

ABSTRACT

It is important to perform neutron transport simulations with accurate nuclear data in the neutronics design of a fusion reactor. However, absolute values of large-angle scattering cross sections vary among nuclear data libraries even for well-examined nuclide of iron. Benchmark experiments focusing on large-angle scattering cross sections were thus performed to confirm the correctness of nuclear data libraries. The series benchmark experiments were performed at a DT neutron source facility, OKTAVIAN of Osaka University, Japan, by the unique experimental system established by the authors’ group, which can extract only the contribution of large-angle scattering reactions. This system consists of two shadow bars, target plate (iron), and neutron detector (niobium). Two types of shadow bars were used and four irradiations were conducted for one experiment, so that contribution of room-return neutrons was effectively removed and only large-angle scattering neutrons were extracted from the measured four Nb reaction rates. The obtained experimental results were compared with calculations for five nuclear data libraries including JENDL-4.0, JEFF.-3.3, FENDL-3.1, ENDF/B- VII, and recently released ENDF/B-VIII. It was found from the comparison that ENDF/B-VIII showed the best result, though ENDF/B-VII showed overestimation and others are in large underestimation at 14 MeV.     

A comparative study between PVO-based framework and multi-predictor mechanism in reversible data hiding

Sorting-based reversible data hiding (RDH) methods like pixel-value-ordering (PVO) can predict pixel values accurately and achieve an extremely low distortion on the embedded image. However, the excellent performance of these methods was not well explained in previous works, and there are unexploited common points among them. In this paper, we propose a general multi-predictor (GMP) framework to summarize PVO-based RDH methods and explain their high prediction accuracy. Moreover, by utilizing the proposed GMP framework, a more efficient sorting-based RDH method is given as an example to show the generality and applicability of our framework. Comparing with other PVO-based methods, the proposed example method can achieve significant improvement in embedding performance. It is hopeful that more efficient sorting-based RDH algorithms can be designed according to our proposed framework by designing better predictors and their combination methods.     

Mixture ratio modeling of dynamic systems

Any knowledge extraction relies (possibly implicitly) on a hypothesis about the modelled-data dependence. The extracted knowledge ultimately serves to a decision-making (DM). DM always faces uncertainty and this makes probabilistic modelling adequate. The inspected black-box modeling deals with “universal” approximators of the relevant probabilistic model. Finite mixtures with components in the exponential family are often exploited. Their attractiveness stems from their flexibility, the cluster interpretability of components and the existence of algorithms for processing high-dimensional data streams. They are even used in dynamic cases with mutually dependent data records while regression and auto-regression mixture components serve to the dependence modeling. These dynamic models, however, mostly assume data-independent component weights, that is, memoryless transitions between dynamic mixture components. Such mixtures are not universal approximators of dynamic probabilistic models. Formally, this follows from the fact that the set of finite probabilistic mixtures is not closed with respect to the conditioning, which is the key estimation and predictive operation. The paper overcomes this drawback by using ratios of finite mixtures as universally approximating dynamic parametric models. The paper motivates them, elaborates their approximate Bayesian recursive estimation and reveals their application potential.     

A machine learning‐based operational control framework for reducing energy consumption of an amine‐based gas sweetening process

This study proposes a data‐driven operational control framework using machine learning‐based predictive modeling with the aim of decreasing the energy consumption of a natural gas sweetening process. This multi‐stage framework is composed of the following steps: (a) a clustering algorithm based on Density‐Based Spatial Clustering of Applications with Noise methodology is implemented to characterize the sampling space of all possible states of the operation and to determine the operational modes of the gas sweetening unit, (b) the lowest steam consumption of each operational mode is selected as a reference for operational control of the gas sweetening process, and (c) a number of high‐accuracy regression models are developed using the Gradient Boosting Machines algorithm for predicting the controlled parameters and output variables. This framework presents an operational control strategy that provides actionable insights about the energy performance of the current operations of the unit and also suggests the potential of energy saving for gas treating plant operators. The ultimate goal is to leverage this data‐driven strategy in order to identify the achievable energy conservation opportunity in such plants. The dataset for this research study consists of 29 817 records that were sampled over the course of 3 years from a gas train in the South Pars Gas Complex. Furthermore, our offline analysis demonstrates that there is a potential of 8% energy saving, equivalent to 5 760 000 Nm³ of natural gas consumption reduction, which can be achieved by mapping the steam consumption states of the unit to the best energy performances predicted by the proposed framework.     

Integration of machine learning and first principles models

Model building and parameter estimation are traditional concepts widely used in chemical, biological, metallurgical, and manufacturing industries. Early modeling methodologies focused on mathematically capturing the process knowledge and domain expertise of the modeler. The models thus developed are termed first principles models (or white-box models). Over time, computational power became cheaper, and massive amounts of data became available for modeling. This led to the development of cutting edge machine learning models (black-box models) and artificial intelligence (AI) techniques. Hybrid models (gray-box models) are a combination of first principles and machine learning models. The development of hybrid models has captured the attention of researchers as this combines the best of both modeling paradigms. Recent attention to this field stems from the interest in explainable AI (XAI), a critical requirement as AI systems become more pervasive. This work aims at identifying and categorizing various hybrid models available in the literature that integrate machine-learning models with different forms of domain knowledge. Benefits such as enhanced predictive power, extrapolation capabilities, and other advantages of combining the two approaches are summarized. The goal of this article is to consolidate the published corpus in the area of hybrid modeling and develop a comprehensive framework to understand the various techniques presented. This framework can further be used as the foundation to explore rational associations between several models.     

Determining robust reaction kinetics from limited data

Accurate chemical kinetics are essential for reactor design and operation. However, despite recent advances in “big data” approaches, availability of kinetic data is often limited in industrial practice. Herein, we present a comparative proof-of-concept study for kinetic parameter estimation from limited data. Cross-validation (CV) is implemented to nonlinear least-squares (LS) fitting and evaluated against Markov chain Monte Carlo (MCMC) and genetic algorithm (GA) routines using synthetic data generated from a simple model reaction. As expected, conventional LS is fastest but least accurate in predicting true kinetics. MCMC and GA are effective for larger data sets but tend to overfit to noise for limited data. LS-CV strongly outperforms these methods at much reduced computational cost, especially for significant noise. Our findings suggest that implementation of CV with conventional regression provides an efficient approach to kinetic parameter estimation with high accuracy, robustness against noise, and only minimal increase in complexity.     

Prediction of risk factors of cyberbullying-related words in Korea: Application of data mining using social big data

The study examined a decision tree analysis using social big data to conduct the prediction model on types of risk factors related to cyberbullying in Korea. The study conducted an analysis of 103,212 buzzes that had noted causes of cyberbullying and data were collected from 227 online channels, such as news websites, blogs, online groups, social network services, and online bulletin boards. Using opinion-mining method and decision tree analysis, the types of cyberbullying were sorted using SPSS 25.0. The results indicated that the total rate of types of cyberbullying in Korea was 44%, which consisted of 32.3% victims, 6.4% perpetrators, and 5.3% bystanders. According to the results, the impulse factor was also the greatest influence on the prediction of the risk factors and the propensity for dominance factor was the second greatest factor predicting the types of risk factors. In particular, the impulse factor had the most significant effect on bystanders, and the propensity for dominance factor was also significant in influencing online perpetrators. It is necessary to develop a program to diminish the impulses that were initiated by bystanders as well as victims and perpetrators because many of those bystanders have tended to aggravate impulsive cyberbullying behaviors.     

A single-phase algorithm for mining high utility itemsets using compressed tree structures

Mining high utility itemsets (HUIs) from transaction databases considers such factors as the unit profit and quantity of purchased items. Two-phase tree-based algorithms transform a database into compressed tree structures and generate candidate patterns through a recursive pattern-growth procedure. This procedure requires a lot of memory and time to construct conditional pattern trees. To address this issue, this study employs two compressed tree structures, namely, Utility Count Tree and String Utility Tree, to enumerate valid patterns and thus promote fast utility computation. Furthermore, the study presents an algorithm called single-phase utility computation (SPUC) that leverages these two tree structures to mine HUIs in a single phase by incorporating novel pruning strategies. Experiments conducted on both real and synthetic datasets demonstrate the superior performance of SPUC compared with IHUP, UP-Growth, and UP-Growth+ algorithms.     

Comparing open data benchmarks: Which metrics and methodologies determine countries’ positions in the ranking lists?

An understanding of the similar and divergent metrics and methodologies underlying open government data benchmarks can reduce the risks of the potential misinterpretation and misuse of benchmarking outcomes by policymakers, politicians, and researchers. Hence, this study aims to compare the metrics and methodologies used to measure, benchmark, and rank governments' progress in open government data initiatives. Using a critical meta-analysis approach, we compare nine benchmarks with reference to meta-data, meta-methods, and meta-theories. This study finds that both existing open government data benchmarks and academic open data progress models use a great variety of metrics and methodologies, although open data impact is not usually measured. While several benchmarks’ methods have changed over time, and variables measured have been adjusted, we did not identify a similar pattern for academic open data progress models. This study contributes to open data research in three ways: 1) it reveals the strengths and weaknesses of existing open government data benchmarks and academic open data progress models; 2) it reveals that the selected open data benchmarks employ relatively similar measures as the theoretical open data progress models; and 3) it provides an updated overview of the different approaches used to measure open government data initiatives’ progress. Finally, this study offers two practical contributions: 1) it provides the basis for combining the strengths of benchmarks to create more comprehensive approaches for measuring governments’ progress in open data initiatives; and 2) it explains why particular countries are ranked in a certain way. This information is essential for governments and researchers to identify and propose effective measures to improve their open data initiatives.